Search results for "finite [mass]"
showing 10 items of 356 documents
Evolution of the Global Distribution of Carbon Dioxide: A Finite Mixture Analysis
2015
Economists and environmental policymakers have recently begun advocating a bottom-up approach to climate change mitigation, focusing on reduction targets for groups of nations, rather than large scale global policies. We advance this discussion by taking a quantitative perspective, focusing on econometric identification of groups of countries that have statistically similar distributions of carbon emissions using a broad range of finite mixture models. Nearly all of our results yield a consistent pattern: after 1980, there are two distinct emissions distributions, and that these distributions continue to evolve over time. We provide a rigorous analysis of these distributional differences al…
Incentive and Selection Effects of Medigap Insurance on Inpatient Care
2012
The Medicare program, which provides insurance coverage to the elderly in the United States, does not protect them fully against high out-of-pocket costs. For this reason private supplementary insurance, named Medigap, has been available to cover Medicare gaps. This paper studies how Medigap affects the utilization of inpatient care, separating the incentive and selection effects of supplementary insurance. For this purpose, we use two alternative estimation methods: a standard recursive bivariate probit and a discrete multivariate finite mixture model. We find that estimated incentive effects are modest and quite similar across models. On the other hand, there seems to be very significant …
Constructing a Pareto front approximation for decision making
2011
An approach to constructing a Pareto front approximation to computationally expensive multiobjective optimization problems is developed. The approximation is constructed as a sub-complex of a Delaunay triangulation of a finite set of Pareto optimal outcomes to the problem. The approach is based on the concept of inherent nondominance. Rules for checking the inherent nondominance of complexes are developed and applying the rules is demonstrated with examples. The quality of the approximation is quantified with error estimates. Due to its properties, the Pareto front approximation works as a surrogate to the original problem for decision making with interactive methods. Qc 20120127
MUTUAL INDUCTANCE FOR AN EXPLICITLY FINITE NUMBER OF TURNS
2011
Non coaxial mutual inductance calculations, based on a Bessel function formulation, are presented for coils modelled by an explicitly flnite number of circular turns. The mutual inductance of two such turns can be expressed as an integral of a product of three Bessel functions and an exponential factor, and it is shown that the exponential factors can be analytically summed as a simple geometric progression, or other related sums. This allows the mutual inductance of two thin solenoids to be expressed as an integral of a single analytical expression. Sample numerical results are given for some representative cases and the approach to the limit where the turns are considered to be smeared ou…
Matheuristics for the irregular bin packing problem with free rotations
2017
[EN] We present a number of variants of a constructive algorithm able to solve a wide variety of variants of the Two-Dimensional Irregular Bin Packing Problem (2DIBPP). The aim of the 2DIBPP is to pack a set of irregular pieces, which may have concavities, into stock sheets (bins) with fixed dimensions in such a way that the utilization is maximized. This problem is inspired by a real application from a ceramic company in Spain. In addition, this problem arises in other industries such as the garment industry or ship building. The constructive procedure presented in this paper allows both free orientation for the pieces, as in the case of the ceramic industry, or a finite set of orientation…
Direct Numerical Methods for Optimal Control Problems
2003
Development of interior point methods for linear and quadratic programming problems occurred during the 1990’s. Because of their simplicity and their convergence properties, interior point methods are attractive solvers for such problems. Moreover, extensions have been made to more general convex programming problems.
A Stochastic Search on the Line-Based Solution to Discretized Estimation
2012
Published version of a chapter in the book: Advanced Research in Applied Artificial Intelligence. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-642-31087-4_77 Recently, Oommen and Rueda [11] presented a strategy by which the parameters of a binomial/multinomial distribution can be estimated when the underlying distribution is nonstationary. The method has been referred to as the Stochastic Learning Weak Estimator (SLWE), and is based on the principles of continuous stochastic Learning Automata (LA). In this paper, we consider a new family of stochastic discretized weak estimators pertinent to tracking time-varying binomial distributions. As opposed to the SLWE, our p…
Sufficient conditions for coincidence in ℓ1 multifacility location problems
1997
We consider the problem of finding the optimal way of locating a finite number of facilities in a finite dimensional space, in order to minimize a weighted sum of the distances between these and other pre-existent facilities which are already positioned. We study the specific case where distance is measured in the @?"1, giving a new sufficient condition for identifying groups of facilities whose position will coincide at optimality.
Solving the pentahedron problem
2015
Nowadays, all geometric modelers provide some tools for specifying geometric constraints. The 3D pentahedron problem is an example of a 3D Geometric Constraint Solving Problem (GCSP), composed of six vertices, nine edges, five faces (two triangles and three quadrilaterals), and defined by the lengths of its edges and the planarity of its quadrilateral faces. This problem seems to be the simplest non-trivial problem, as the methods used to solve the Stewart platform or octahedron problem fail to solve it. The naive algebraic formulation of the pentahedron yields an under-constrained system of twelve equations in eighteen unknowns. Even if the use of placement rules transforms the pentahedron…
Deflation-Based FastICA With Adaptive Choices of Nonlinearities
2014
Deflation-based FastICA is a popular method for independent component analysis. In the standard deflation-base d approach the row vectors of the unmixing matrix are extracted one after another always using the same nonlinearities. In prac- tice the user has to choose the nonlinearities and the efficiency and robustness of the estimation procedure then strongly depends on this choice as well as on the order in which the components are extracted. In this paper we propose a novel adaptive two- stage deflation-based FastICA algorithm that (i) allows one to use different nonlinearities for different components and (ii) optimizes the order in which the components are extracted. Based on a consist…